Minimizing worst-case and average-case makespan over scenarios
نویسندگان
چکیده
منابع مشابه
Minimizing worst-case and average-case makespan over scenarios
We consider scheduling problems over scenarios where the goal is to find a single assignment of the jobs to the machines which performs well over all scenarios in an explicitly given set. Each scenario is a subset of jobs that must be executed in that scenario. The two objectives that we consider are minimizing the maximum makespan over all scenarios and minimizing the sum of the makespans of a...
متن کاملWorst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
In 1976, Coffman and Sethi conjectured that a natural extension of LPT list scheduling to the bicriteria scheduling problem of minimizing makespan over flowtime optimal schedules, called the LD algorithm, has a simple worst-case performance bound: 5m−2 4m−1 , where m is the number of machines. We study the structure of potential minimal counterexamples to this conjecture, provide some new tools...
متن کامل1 Worst - Case vs . Average - Case Complexity
So far we have dealt mostly with the worst-case complexity of problems. We might also wonder aobut the average-case complexity of a problem, namely, how difficult the problem is to solve for an instance chosen randomly from some distribution. It may be the case for a certain problem that hard instances exist but are extremely rare. Many reductions use very specifically constructed problems, so ...
متن کاملWorst-Case to Average-Case Reductions Revisited
A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and a language in NTIME(f(n)) for some polynomial function f , such that the language is hard on the average with respect to this distribution, given that NP is worst-case hard (i.e. NP 6= P, or NP 6⊆ BPP). Currently, no such resul...
متن کاملAverage-Case Intractability vs. Worst-Case Intractability
We use the assumption that all sets in NP (or other levels of the polynomial-time hierarchy) have eecient average-case algorithms to derive collapse consequences for MA, AM, and various subclasses of P/poly. As a further consequence we show for C 2 fP(PP); PSPACEg that C is not tractable in the average-case unless C = P.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2016
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-016-0484-y